%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2015/06.25.01.20
%2 sid.inpe.br/sibgrapi/2015/06.25.01.20.35
%@doi 10.1109/SIBGRAPI.2015.51
%T A 3D Shape Descriptor based on Depth Complexity and Thickness Histograms
%D 2015
%A Schmitt, Wagner,
%A Sotomayor, Jose L.,
%A Telea, Alexandru,
%A Silva, Clįudio T.,
%A Comba, Joćo L. D.,
%@affiliation UFRGS
%@affiliation UFRGS
%@affiliation University of Groningen
%@affiliation New York University
%@affiliation UFRGS
%E Papa, Joćo Paulo,
%E Sander, Pedro Vieira,
%E Marroquim, Ricardo Guerra,
%E Farrell, Ryan,
%B Conference on Graphics, Patterns and Images, 28 (SIBGRAPI)
%C Salvador, BA, Brazil
%8 26-29 Aug. 2015
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Shape matching, Shape analysis, Depth complexity, Thickness, Histograms, Content-based retrieval.
%X Geometric models play a vital role in several fields, from the entertainment industry to scientific applications. To reduce the high cost of model creation, reusing existing models is the solution of choice. Model reuse is supported by content- based shape retrieval (CBR) techniques that help finding the desired models in massive repositories, many publicly available on the Internet. Key to efficient and effective CBR techniques are shape descriptors that accurately capture the characteristics of a shape and can discriminate between different shapes. We present a descriptor based on the distribution of two global features measured in a 3D shape, depth complexity and thickness, which respectively capture aspects of the geometry and topology of 3D shapes. The final descriptor, called DCTH (depth complexity and thickness histogram), is a 2D histogram that is invariant to the translation, rotation and scale of geometric shapes. We efficiently implement the DCTH on the GPU, allowing its use in real-time queries of large model databases. We validate the DCTH with the Princeton and Toyohashi Shape Benchmarks, containing 1815 and 10000 models respectively. Results show that DCTH can discriminate meaningful classes of these benchmarks and is fast to compute and robust against shape transformations and different levels of subdivision and smoothness.
%@language en
%3 PID3771963.pdf